2,735 research outputs found

    Some characterizations of Howson PC-groups

    Get PDF
    We show that in the class of partially commutative groups, the conditions of being Howson, being fully residually free, and being free product of free-abelian groups, are equivalent

    Intersection problem for Droms RAAGs

    Get PDF
    We solve the subgroup intersection problem (SIP) for any RAAG G of Droms type (i.e., with defining graph not containing induced squares or paths of length 3): there is an algorithm which, given finite sets of generators for two subgroups H,K of G, decides whether H∩KH \cap K is finitely generated or not, and, in the affirmative case, it computes a set of generators for H∩KH \cap K. Taking advantage of the recursive characterization of Droms groups, the proof consists in separately showing that the solvability of SIP passes through free products, and through direct products with free-abelian groups. We note that most of RAAGs are not Howson, and many (e.g. F_2 x F_2) even have unsolvable SIP.Comment: 33 pages, 12 figures (revised following the referee's suggestions

    Small-world behavior in a system of mobile elements

    Full text link
    We analyze the propagation of activity in a system of mobile automata. A number r L^d of elements move as random walkers on a lattice of dimension d, while with a small probability p they can jump to any empty site in the system. We show that this system behaves as a Dynamic Small-World (DSW) and present analytic and numerical results for several quantities. Our analysis shows that the persistence time T* (equivalent to the persistence size L* of small-world networks) scales as T* ~ (r p)^(-t), with t = 1/(d+1).Comment: To appear in Europhysics Letter

    Ordre, caos i complexitat

    Get PDF

    La rebotiga: sobre el que és comú i el que és divers

    Get PDF

    Algorithmic recognition of infinite cyclic extensions

    Get PDF
    We prove that one cannot algorithmically decide whether a finitely presented Z\mathbb{Z}-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the equivalence between the isomorphism problem within the subclass of unique Z\mathbb{Z}-extensions, and the semi-conjugacy problem for deranged outer automorphisms.Comment: 24 page
    • …
    corecore